Solving the regenerator location problem with an iterated greedy approach

The evolution of digital communications has resulted in new services that require from secure and robust connections. Nowadays, a signal must be transmitted to distant nodes, the quality deteriorates as distance between endpoints increases. Regenerators are special components able restore signal, order increase can travel without losing quality. These very expensive deploy maintain and, for this reason, it is desirable minimum number regenerators network. We propose metaheuristic algorithm based on Iterated Greedy methodology tackle Regenerator Location Problem, whose objective minimize required extensive computational experiments show performance proposed method compared with best previous found state art.